An interval type-2 fuzzy K-nearest neighbor
نویسندگان
چکیده
This paper presents an interval type-2 fuzzy Knearest neighbor (NN) algorithm that is an extension of the type1 fuzzy K-NN algorithm proposed in [l]. In our proposed method, the membership values for each vector are 'extended as interval type-2 fuzzy memberships by assigning uncertainty to the type-1 memberships. By doing so, the classification result obtained by the interval type-2 fuzzy K-NN is found to he more reasonable than that of the crisp and type-1 effectiveness of our method. For this extension, we use initial K values in an appropriate r ~ , g e , ~ ~ ~ d l , ~ ~ of this uncertainty can decrease the contribution of an undesirable initial K on the classification process for the patterns. Hence, this can provide a more reasonable classification result by managing the uncertainty for the selected initial K , possesses the following advantages. fumy K-". Experimental results are given to show the In Our proposed type-2 approach
منابع مشابه
FUZZY K-NEAREST NEIGHBOR METHOD TO CLASSIFY DATA IN A CLOSED AREA
Clustering of objects is an important area of research and application in variety of fields. In this paper we present a good technique for data clustering and application of this Technique for data clustering in a closed area. We compare this method with K-nearest neighbor and K-means.
متن کاملFINkNN: A Fuzzy Interval Number k-Nearest Neighbor Classifier for Prediction of Sugar Production from Populations of Samples
This work introduces FINkNN, a k-nearest-neighbor classifier operating over the metric lattice of conventional interval-supported convex fuzzy sets. We show that for problems involving populations of measurements, data can be represented by fuzzy interval numbers (FINs) and we present an algorithm for constructing FINs from such populations. We then present a latticetheoretic metric distance be...
متن کاملFuzzy nearest neighbor algorithms: Taxonomy, experimental analysis and prospects
In recent years, many nearest neighbor algorithms based on fuzzy sets theory have been developed. These methods form a field, known as fuzzy nearest neighbor classification, which is the source of many proposals for the enhancement of the k nearest neighbor classifier. Fuzzy sets theory and several extensions, including fuzzy rough sets, intuitionistic fuzzy sets, type-2 fuzzy sets and possibil...
متن کاملEvolutionary fuzzy k-nearest neighbors algorithm using interval-valued fuzzy sets
One of the most known and effective methods in supervised classification is the K-Nearest Neighbors classifier. Several approaches have been proposed to enhance its precision, with the Fuzzy K-Nearest Neighbors (Fuzzy-kNN) classifier being among the most successful ones. However, despite its good behavior, Fuzzy-kNN lacks of a method for properly defining several mechanisms regarding the repres...
متن کاملPresentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition
Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...
متن کامل